Deformable Geometry Model Matching Using Bipartite Graph

نویسندگان

  • Kwok-Leung Tam
  • Rynson W.H. Lau
  • Chong-Wah Ngo
چکیده

In this paper, we present a novel method for efficient 3D model comparison. The method is designed to match highly deformed models through capturing two types of information. First, we propose a feature point extraction algorithm, which is based on “Level Set Diagram”, to reliably capture the topological points of a general 3D model. These topological points represent the skeletal structure of the model. Second, we also capture both spatial and curvature information, which describes the global surface of a 3D model. This is different from traditional topological 3D matching methods that use only low-dimension local features. Our method can accurately distinguish different types of 3D models even if they have similar topology. By applying the bipartite graph matching technique, our method can achieve a high precision of 0.54 even at a recall rate of 1.0 as demonstrated in our experimental results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounding cochordal cover number of graphs via vertex stretching

It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...

متن کامل

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs

A bipartite graph G = (U, V,E) is convex if the vertices in V can be linearly ordered such that for each vertex u ∈ U , the neighbors of u are consecutive in the ordering of V . An induced matching H of G is a matching such that no edge of E connects endpoints of two different edges of H. We show that in a convex bipartite graph with n vertices and m weighted edges, an induced matching of maxim...

متن کامل

Fast Filtering Heuristics for Perfect Bipartite Matchings

The bipartite matching problem has wide applicability. For example, in computer science, researchers have applied bipartite matching in objection recognition, image processing, scheduling, genomics, term rewriting and formal verification, and computer security. We present a heuristic model of perfect matchings in bipartite graphs. The goal of the model is to explore the use of low-cost heuristi...

متن کامل

Coverings, matchings and paired domination in fuzzy graphs using strong arcs

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

متن کامل

On the Induced Matching Problem in Hamiltonian Bipartite Graphs

In this paper, we study the parameterized complexity and inapproximability of the Induced Matching problem in hamiltonian bipartite graphs. We show that, given a hamiltonian cycle in a hamiltonian bipartite graph, the problem is W[1]-hard and cannot be solved in time n 1 2 ) unless W[1]=FPT, where n is the number of vertices in the graph. In addition, we show that unless NP=P, the maximum induc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004